Variance Reduction via Lattice
نویسنده
چکیده
This is a review article on lattice methods for multiple integration over the unit hypercube, with a variance-reduction viewpoint. It also contains some new results and ideas. The aim is to examine the basic principles supporting these methods and how they can be used eeectively for the simulation models that are typically encountered in the area of Management Science. These models can usually be reformulated as integration problems over the unit hypercube with a large (sometimes innnite) number of dimensions. We examine selection criteria for the lattice rules and suggest criteria which take into account the quality of the projections of the lattices over selected low-dimensional subspaces. The criteria are strongly related to those used for selecting linear congruential and multiple recursive random number generators. Numerical examples illustrate the eeectiveness of the approach.
منابع مشابه
A Comparison of Monte Carlo , Lattice Rulesand Other Low - Discrepancy Point
We explore how lattice rules can reduce the variance of the estimators for simulation problems, in comparison with the Monte Carlo method. To do this, we compare these two methods on option valuation problems in nance, along with two types of (t; s)-sequences. We also look at the eeect of combining variance reduction techniques with the preceding approaches. Our numerical results seem to indica...
متن کاملEfficient Weighted Lattice Rules with Applications to Finance
Good lattice rules are an important type of quasi-Monte Carlo algorithms. They are known to have good theoretical properties, in the sense that they can achieve an error bound (or optimal error bound) that is independent of the dimension for weighted spaces with suitably decaying weights. To use the theory of weighted function spaces for practical applications, one has to determine what weights...
متن کاملOptimum Block Size in Separate Block Bootstrap to Estimate the Variance of Sample Mean for Lattice Data
The statistical analysis of spatial data is usually done under Gaussian assumption for the underlying random field model. When this assumption is not satisfied, block bootstrap methods can be used to analyze spatial data. One of the crucial problems in this setting is specifying the block sizes. In this paper, we present asymptotic optimal block size for separate block bootstrap to estimate the...
متن کاملar X iv : h ep - l at / 9 91 10 13 v 2 1 2 N ov 1 99 9 BU / HEPP / 99 - 03 Noise Methods for Flavor Singlet Quantities ⋆
A discussion of methods for reducing the noise variance of flavor singlet quantities (“disconnected diagrams”) in lattice QCD is given. After an introduction, the possible advantage of partitioning the Wilson fermion matrix into disjoint spaces is discussed and a numerical comparison of the variance for three possible partitioning schemes is carried out. The measurement efficiency of lattice op...
متن کاملar X iv : h ep - l at / 9 91 10 13 v 1 1 0 N ov 1 99 9 BU / HEPP / 99 - 03 Noise Methods for Flavor Singlet Quantities
A discussion of methods for reducing the noise variance of flavor singlet quantities (“disconnected diagrams”) in lattice QCD is given. After an introduction, the possible advantage of partitioning the Wilson fermion matrix into disjoint spaces is discussed and a numerical comparison of the variance for three possible partitioning schemes is carried out. The measurement efficiency of lattice op...
متن کامل